New SIMD Algorithms for Cluster Labeling on Parallel Computers

A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question whether there exists an O(n)–time and O(log n)–space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack–like data structures to achieve the lower bound o...

Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

A Multi-Grid Cluster Labeling Scheme

Number of multi-grid cycles needed to converge as a function of log 2 L for the case of bond percolation (circles) and the Ising model (squares), both at the critical point in two dimensions. The lines are 2 ts to the points. The number of congurations ranges from 100 to 1000 for the dierent values of L. 7 algorithms which have been shown to reduce critical slowing down in many dierent systems ...

Cluster Identification Algorithms for Spin Models - Sequential and Parallel

Monte Carlo cluster update algorithms are extremely eecient for simulating spin models near their phase transitions, where local update algorithms suuer severe critical slowing down. Unfortunately, as the cluster algorithms are highly irregular as well as non-local, they are much more diicult to parallelize eeciently. The main diiculty lies in identifying which spins belong to which cluster. In...

Practical Algorithms for Image Component Labeling on SIMD Mesh Connected Computers